
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1635. -- [Usaco2007 Jan]Tallest Cow -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1635: [Usaco2007 Jan]Tallest Cow</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>112&nbsp;&nbsp;<span class=green>Solved: </span>66<br>[<a href='submitpage.php?id=1635'>Submit</a>][<a href='problemstatus.php?id=1635'>Status</a>][<a href='bbs.php?id=1635'>Discuss</a>]</center><h2>Description</h2><div class=content>FJ's N (1 <= N <= 10,000) cows conveniently indexed 1..N are standing
in a line.  Each cow has a positive integer height (which is a bit
of secret). You are told only the height H (1 <= H <= 1,000,000)
of the tallest cow along with the index I of that cow.

FJ has made  a list of R (0 <= R <= 10,000) lines of the form "cow
17 sees cow 34". This means that cow 34 is at least as tall as cow
17, and that every cow between 17 and 34 has a height that is
strictly smaller than that of cow 17.

For each cow from 1..N, determine its maximum possible height, such
that all of the information given is still correct. It is guaranteed
that it is possible to satisfy all the constraints.

有n(1 <= n <= 10000)头牛从１到n线性排列，每头牛的高度为h[i](1 <= i <= n),现在告诉你这里面的牛的最大高度为maxH,而且有r组关系，每组关系输入两个数字，假设为a和b,表示第a头牛能看到第b头牛，能看到的条件是a, b之间的其它牛的高度都严格小于min(h[a], h[b]),而h[b] >= h[a]</div><h2>Input</h2><div class=content>* Line 1: Four space-separated integers: N, I, H and R

* Lines 2..R+1: Two distinct space-separated integers A and B (1 <= A,
        B <= N), indicating that cow A can see cow B.

</div><h2>Output</h2><div class=content>* Lines 1..N: Line i contains the maximum possible height of cow i.

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>9 3 5 5<br />
1 3<br />
5 3<br />
4 3<br />
3 7<br />
9 8<br />
<br />
<br />
INPUT DETAILS:<br />
<br />
There are 9 cows, and the 3rd is the tallest with height 5.<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>5<br />
4<br />
5<br />
3<br />
4<br />
4<br />
5<br />
5<br />
5<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1635'>Submit</a>][<a href='problemstatus.php?id=1635'>Status</a>][<a href='bbs.php?id=1635'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
